Private Graph Extraction via Feature Explanations
نویسندگان
چکیده
Privacy and interpretability are two important ingredients for achieving trustworthy machine learning. We study the interplay of these aspects in graph learning through reconstruction attacks. The goal adversary here is to reconstruct structure training data given access model explanations. Based on different kinds auxiliary information available adversary, we propose several show that additional knowledge post-hoc feature explanations substantially increases success rate Further, investigate detail differences between attack performance with respect three classes explanation methods neural networks: gradient-based, perturbation-based, surrogate model-based methods. While gradient-based reveal most terms structure, find do not always score high utility. For other explanations, privacy leakage an increase Finally, a defense based randomized response mechanism releasing which reduces rate. Our code at https://github.com/iyempissy/graph-stealing-attacks-with-explanation.
منابع مشابه
Deep Private-Feature Extraction
We present and evaluate Deep Private-Feature Extractor (DPFE), a deep model which is trained and evaluated based on information theoretic constraints. Using the selective exchange of information between a user’s device and a service provider, DPFE enables the user to prevent certain sensitive information from being shared with a service provider, while allowing them to extract approved informat...
متن کاملLandmark Extraction via Planning Graph Propagation
The planner GRAPHPLAN is based on an efficient propagation of reachability information which then effectively guides a search for a valid plan. We propose a framework in which a broader class of information, including the original reachability information, can be propagated in the plan graph in polynomial time. As an example, we exhibit an algorithm for propagating “landmark” information, where...
متن کاملFeature Extraction via Compressed Local Mahalanobis Metrics
We propose a new energy-based ([1]) online learning approach to the problem of extracting small features from high dimensional, noisy datasets. We demonstrate the power of this new technique by applying it to the Detection of cellular nuclei in large hyperspectral images. Thus, we prove that only a minimum number of random, wideband measurements is necessary to achieve efficient feature extract...
متن کاملSkeletal Graph Based Topological Feature Extraction of an Object
The propose a novel algorithm that compute a skeletal graph and thus capture the topology of an object Topology is an important attribute of an object which describes how different parts of an object surface are connected to each other. The method is based on capturing the topology of a modified reeb graph by tracking the critical points of a distance function. The algorithm for constructing th...
متن کاملVariational Graph Embedding for Globally and Locally Consistent Feature Extraction
Existing feature extraction methods explore either global statistical or local geometric information underlying the data. In this paper, we propose a general framework to learn features that account for both types of information based on variational optimization of nonparametric learning criteria. Using mutual information and Bayes error rate as example criteria, we show that high-quality featu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings on Privacy Enhancing Technologies
سال: 2023
ISSN: ['2299-0984']
DOI: https://doi.org/10.56553/popets-2023-0041